A note on the Wolovich method of extraction of a greatest common divisor of two polynomial matricesSOLAK, M. K.IEEE transactions on automatic control. 1985, Vol 30, Num 10, pp 1032-1033, issn 0018-9286Article

THE COMPUTING TIME OF THE EUCLIDENA ALGORITHM.COLLINS GE.1974; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1974; VOL. 3; NO 1; PP. 1-10; BIBL. 12 REF.Article

ALGORITHME EXPLICITE POUR LA RECHERCHE DU P.G.C.D. DANS CERTAINS ANNEAUX PRINCIPAUX D'ENTIERS DE CORPS DE NOMBRESBOUGAUT B.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 11; NO 2; PP. 207-220; ABS. ENG; BIBL. 4 REF.Article

Efficient checkers for number-theoretic computationsADLEMAN, L. M; MING-DEH HUANG; KOMPELLA, K et al.Information and computation (Print). 1995, Vol 121, Num 1, pp 93-102, issn 0890-5401Article

Improvements of the power-series coefficient polynomial remainder sequence GCD algorithmSUZUKI, M.Japan journal of industrial and applied mathematics. 1993, Vol 10, Num 1, pp 41-67, issn 0916-7005Article

Calcul sur les grands nombres et VLSI: application au PGCD, au PGCD étendu et à la distance euclidienne = Very large integer arithmetic in VLSI and its application to the GCD, entended GCD and Euclidean distance algorithmsBouraoui, Rachid; Guyot, Alain.1993, 180 p.Thesis

Higher-dimensional GCD matricesHAUKKANEN, P.Linear algebra and its applications. 1992, Vol 170, pp 53-63, issn 0024-3795Article

On GCD and LCM matricesBOURQUE, K; LIGH, S.Linear algebra and its applications. 1992, Vol 174, pp 65-74, issn 0024-3795Article

A lower bound for integer greatest common divisor computationsYISHAY MANSOUR; BARUCH SCHIEBER; PRASOON TIWARI et al.Journal of the Association for Computing Machinery. 1991, Vol 38, Num 2, pp 453-471, issn 0004-5411, 19 p.Article

A SYSTEM THEORETIC INTERPRETATION FOR GCD EXTRACTIONSILVERMAN LM; VAN DOOREN P.1981; IEEE TRANS. AUTOMAT. CONTROL; ISSN 0018-9286; USA; DA. 1981; VOL. 26; NO 6; PP. 1273-1276; BIBL. 14 REF.Article

Embedding GCD domains in Bézout domainsSHAMASH, J; SMITH, S. T.Journal of the London Mathematical Society. 1993, Vol 48, pp 15-30, issn 0024-6107, 1Article

The computation of polynomial greatest common divisors over an algebraic number fieldLANGEMYR, L; MCCALLUM, S.Journal of symbolic computation. 1989, Vol 8, Num 5, pp 429-448, issn 0747-7171Article

Systolic VLSI arrays for polynomial GCD computationBRENT, R. P.IEEE transactions on computers. 1984, Vol 33, Num 8, pp 731-736, issn 0018-9340Article

Jug measuring : Algorithms and complexitySHIEH, Min-Zheng; TSAI, Shi-Chun.Theoretical computer science. 2008, Vol 396, Num 1-3, pp 50-62, issn 0304-3975, 13 p.Article

Two efficient algorithms for the computation of ideal sums in quadratic ordersWEILERT, André.Mathematics of computation. 2006, Vol 75, Num 254, pp 941-981, issn 0025-5718, 41 p.Article

Complexity of factoring and calculating the GCD of linear ordinary differential operatorsGRIGOR'EV, D. YU.Journal of symbolic computation. 1990, Vol 10, Num 1, pp 7-37, issn 0747-7171, 31 p.Article

Three new algorithms for multivariate polynomial GCDSASAKI, T; SUZUKI, M.Journal of symbolic computation. 1992, Vol 13, Num 4, pp 395-411, issn 0747-7171Article

Spécialisation de la suite de Sturm et sous-résultants. I = Specialization of the Sturm sequence and subresultant polynomialsGONZALEZ-VEGA, L; LOMBARDI, H; RECIO, T et al.Informatique théorique et applications (Imprimé). 1990, Vol 24, Num 6, pp 561-588, issn 0988-3754, 28 p.Article

Further results on the enumeration of hamilton paths in Cayley digraphs on semidirect products of cyclic groupsCURRAN, Stephen J.Discrete mathematics. 2008, Vol 308, Num 10, pp 1889-1908, issn 0012-365X, 20 p.Article

A new approach for constructing subresultantsLI, Yong-Bin.Applied mathematics and computation. 2006, Vol 183, Num 1, pp 471-476, issn 0096-3003, 6 p.Article

Some remarks on the Pethö public key cryptosystemLASSAK, M.Astérisque. 1992, Num 209, pp 257-264, issn 0303-1179Conference Paper

Precise analyses of the right- and left-shift greatest common divisor algorithms for GF(q)[x]NORTON, G. H.SIAM journal on computing (Print). 1989, Vol 18, Num 3, pp 608-624, issn 0097-5397Article

AN LLL ALGORITHM WITH QUADRATIC COMPLEXITYNGUYEN, Phong Q; STEHLE, Damien.SIAM journal on computing (Print). 2010, Vol 39, Num 3, pp 874-903, issn 0097-5397, 30 p.Article

Fermat's last theorem and Bezout's theorem in GCD domainsSMITH, S. T.Journal of pure and applied algebra. 1992, Vol 79, Num 1, pp 63-85, issn 0022-4049Article

A subdivision method for computing nearest gcd with certificationCHEZE, Guillaume; GALLIGO, André; MOURRAIN, Bernard et al.Theoretical computer science. 2011, Vol 412, Num 35, pp 4493-4503, issn 0304-3975, 11 p.Article